منابع مشابه
Linear k-arboricities on trees
For a xed positive integer k, the linear k-arboricity lak(G) of a graph G is the minimum number ‘ such that the edge set E(G) can be partitioned into ‘ disjoint sets and that each induces a subgraph whose components are paths of lengths at most k. This paper studies linear k-arboricity from an algorithmic point of view. In particular, we present a linear-time algorithm to determine whether a tr...
متن کاملForestation in Hypergraphs: Linear k-Trees
We present a new proof of a result of Lovász on the maximum number of edges in a k-forest. We also apply a construction used in our proof to generalize the notions of a k-hypertree and k-forest to a class which extends some properties of trees, to which both specialize when k=2.
متن کاملon the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولInterval Routing on k-trees
A graph has an optimaì-interval routing scheme if it is possible to direct messages along shortest paths by labeling each edge with at most`pairwise-disjoint subintervals of the cyclic interval 1 : : : n] (where each node of the graph is labeled by an integer in the range). Although much progress has been made for`= 1, there is as yet no general tight characterization of the classes of graphs a...
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2000
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(99)00247-4